Hybrid Turn-Prohibition Routing Algorithm for the Networks of Workstations

Deadlock is a critical problem of any wormhole network. Algorithms have been developed to avoid or recover from deadlocks. In existing approaches for deadlockfree routing any possibility of deadlock occurrence is eliminated, which can result in putting extra restrictions on the routing or put no restrictions on routing, which leads to other approach namely deadlock recovery. In this paper we are considering hybrid approach for routing, where some prohibition is imposed on routing along with some kind of deadlock recovery. This hybrid approach allows changing the amount of routing restrictions depending on network traffic, thus providing a flexible method to achieve better network performance compared to the existing techniques. The main idea of the proposed method consists in the sequential selections of some turns, which are prohibited during routing. Cost formula is proposed to estimate cost of implementing both strategies in a network.